Semirings and Tree-to-Graph-to-Tree Transductions
نویسندگان
چکیده
منابع مشابه
Semirings and tree-to-graph-to-tree transductions
It is shown that top-down tree transducers are as powerful as sharing-free tree-to-graph-to-tree transducers as far as the computation of functions is considered whose codomain is a semiring.
متن کاملEvaluation of different sampling method to study of tree density (tree/hectare) in the Zagros forest
For maintaining of Zagros forests role in wild life, water and soil conservation, the suitable solutions and methods for assessing the existing conditions and planning for management of this forests should be given. To detection of suitable sampling method to study tree density in the northern Zagros forest, Blake forest, in Baneeh region, Kurdistan province, and west of Iran was selected. 40 s...
متن کاملEvaluation of different sampling method to study of tree density (tree/hectare) in the Zagros forest
For maintaining of Zagros forests role in wild life, water and soil conservation, the suitable solutions and methods for assessing the existing conditions and planning for management of this forests should be given. To detection of suitable sampling method to study tree density in the northern Zagros forest, Blake forest, in Baneeh region, Kurdistan province, and west of Iran was selected. 40 s...
متن کاملTop-Down Tree-To-Graph Transducers
We introduce a new syntax-directed translation device called top-down treeto-graph transducer. Such transducers are very similar to the usual top-down tree trans ducers except that the right-hand sides of their rules are hypergraphs rather than trees. Since we are aiming at a device which also allows to translate trees into objects ditTerent from graphs, we focus our attention on so-called tree...
متن کاملGraph minors. X. Obstructions to tree-decomposition
Graphs in this paper are finite and undirected and may have loops or multiple edges. The vertexand edge-sets of a graph G are denoted by V(G) and E(G). If G, = ( V1, E,), G2 = ( V2, E2) are subgraphs of a graph G, we denote the graphs (V1n V2,E1nE,) and (V,u V2, EluEZ) by G,nG, and G, u GZ, respectively. A separation of a graph G is a pair (G,, G2) of subgraphs with G1 u G2 = G and E(G1 n G2) =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80184-7